package leetcodecompetition.D378;

/**
 * @Author: Siantar
 * @Date: 2023-12-31-10:31
 * @Description: 1.0
 */
public class T100166 {
    public boolean hasTrailingZeros(int[] nums) {
        int n = nums.length;
        for (int i = 0; i < n; i++) {
            for (int j = i + 1; j < n; j++) {
                if (((nums[i] | nums[j]) & 1) == 0) {
                    return true;
                }
            }
        }
        return false;
    }
}
